Solvable groups whose character degree graphs have non-trivial fundamental groups
ثبت نشده
چکیده
In this talk, we introduce the character degree graph of a finite group G. We will discuss various properties of this graph, and we will further discuss what graphs can occur as the character degree graphs of finite solvable groups. In particular, we focus on groups with characters of degree pq, pr, and qr, where p, q, and r are distinct primes. Although some group theory will be assumed, knowledge of the results of character theory should not be necessary.
منابع مشابه
Four-Vertex Degree Graphs of Nonsolvable Groups
For a finite group G, the character degree graph ∆(G) is the graph whose vertices are the primes dividing the degrees of the ordinary irreducible characters of G, with distinct primes p and q joined by an edge if pq divides some character degree of G. We determine all graphs with four vertices that occur as ∆(G) for some nonsolvable group G. Along with previously known results on character degr...
متن کاملOn Bipartite Divisor Graph for Character Degrees
The concept of the bipartite divisor graph for integer subsets has been considered in [M. A. Iranmanesh and C. E. Praeger, Bipartite divisor graphs for integer subsets, Graphs Combin., 26 (2010) 95–105.]. In this paper, we will consider this graph for the set of character degrees of a finite group G and obtain some properties of this graph. We show that if G is a solvable group, then the number...
متن کاملA Survey of Some Questions and Results about Rank 3 Permutation Groups
We use throughout the notation of [5], to which we refer for the basic theory of finite rank 3 permutation groups G. The solvable primitive rank 3 permutation groups have been determined by Foulser [4] and, independently, by Dornhoff [2]. Since rank 3 groups of odd order are solvable we assume that G has even order. Then the graphs JA and JT associated with the non-trivial orbitals A and T of G...
متن کاملGroups whose Bipartite Divisor Graph for Character Degrees Has Five Vertices
Let $G$ be a finite group and $cd^*(G)$ be the set of nonlinear irreducible character degrees of $G$. Suppose that $rho(G)$ denotes the set of primes dividing some element of $cd^*(G)$. The bipartite divisor graph for the set of character degrees which is denoted by $B(G)$, is a bipartite graph whose vertices are the disjoint union of $rho(G)$ and $cd^*(G)$, and a vertex $p in rho(G)$ is conne...
متن کاملSubdirectly Reducible Groups and Edge-minimal Graphs with given Automorphism Group
A group is subdirectly reducible if it has two non-trivial normal subgroups with trivial intersection. Such groups may be an easy case in certain inductive arguments. We prove that every solvable finite group can be generated by at most one subdirectly reducible subgroup together with two subgroups of prime-power order and one element. We also prove that every group of prime-power order can be ...
متن کامل